منابع مشابه
Computational Complexity in Analysis
In this paper we will introduce well motivated definitions of computational complexity on type-2 objects. Similar to the model of Kawamura and Cook (and earlier models) our models will be both based on classical Turing machines and the notion of representations. The main differences to the model of Kawamura and Cook is that we give up type-2-polynomials and, additionally, use parameter based ty...
متن کاملSystematic Parameterized Complexity Analysis in Computational Phonology
Many computational problems are NP -hard and hence probably do not have fast, i.e., polynomial time, algorithms. Such problems may yet have non-polynomial time algorithms, and the non-polynomial time complexities of these algorithms will be functions of particular aspects of that problem, i.e., the algorithm's running time is upper bounded by f(k)jxjc, where f is an arbitrary function, jxj is t...
متن کاملParameterized complexity analysis in computational biology
Many computational problems in biology involve parameters for which a small range of values cover important applications. We argue that for many problems in this setting, parameterized computational complexity rather than NP-completeness is the appropriate tool for studying apparent intractability. At issue in the theory of parameterized complexity is whether a problem can be solved in time O(n...
متن کاملComputational complexity analysis for cognitive scientists
Many computationalor rational-level models of cognition postulate computations that appear to be computationally intractable (e.g., NP-hard or worse). Formally, this means that the postulated computations consume an exponential amount of time. Informally, this means that the postulated computations do not scale in any obvious way to explain how the modeled cognitive capacities can operate in th...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.24.3